Two-coloring Random Hypergraphs
نویسندگان
چکیده
A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a vertex set V of cardinality n, where each k-subset of V is an edge of H with probability p, independently of all other k-subsets. Let m = p(n k ) denote the expected number of edges in H. Let us say that a sequence of events n holds with high probability (w.h.p.) if limn→∞ Pr n = 1. It is easy to show that if m = c2n then w.h.p H is not 2-colorable for c > ln 2/2. We prove that there exists a constant c > 0 such that if m = c2/k n, then w.h.p H is 2-colorable. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20, 249–259, 2002
منابع مشابه
Multipass greedy coloring of simple uniform hypergraphs
Let m∗(n) be the minimum number of edges in an n-uniform simple hypergraph that is not two colorable. We prove that m∗(n) = Ω(4n/ ln(n)). Our result generalizes to r-coloring of b-simple uniform hypergraphs. For fixed r and b we prove that a maximum vertex degree in b-simple n-uniform hypergraph that is not r-colorable must be Ω(rn/ ln(n)). By trimming arguments it implies that every such graph...
متن کاملColoring uniform hypergraphs with few edges
A hypergraph is b-simple if no two distinct edges share more than b vertices. Let m(r, t, g) denote the minimum number of edges in an r-uniform non-t-colorable hypergraph of girth at least g. Erdős and Lovász proved that m(r, t, 3) ≥ t 2(r−2) 16r(r − 1)2 and m(r, t, g) ≤ 4 · 20g−1r3g−5t(g−1)(r+1). A result of Szabó improves the lower bound by a factor of r2− for sufficiently large r. We improve...
متن کاملOn The Choice Number Of Random Hypergraphs
We generalize the notion of choice number from graphs to hypergraphs and estimate the sharp order of magnitude of the choice number of random hypergraphs. It turns out that the choice number and the chromatic number of a random hypergraph have the same order of magnitude, almost surely. Our result implies an earlier bound on the chromatic number of random hypergraphs, proved by Schmidt [Sch] us...
متن کاملRamsey Properties of Random k-Partite, k-Uniform Hypergraphs
We investigate the threshold probability for the property that every r-coloring of the edges of a random binomial k-uniform hypergraph G(k)(n, p) yields a monochromatic copy of some fixed hypergraph G. In this paper we solve the problem for arbitrary k ≥ 3 and k-partite, k-uniform hypergraphs G.
متن کاملArc-coloring of directed hypergraphs and chromatic number of walls
We define an arc-coloring for directed hypergraphs, such that any two arcs having either intersecting tails or the same head must be colored differently. We investigate the arc-coloring of those hypergraphs which can be represented by suitable adjacency matrices (walls), whereas a polynomial reduction is provided from the general arc-coloring problem to the brick-coloring of walls. An upper bou...
متن کاملHypergraph list coloring and Euclidean Ramsey theory
Abstract: It is well known that one can color the plane by 7 colors with no monochromatic configuration consisting of the two endpoints of a unit segment. In sharp contrast we show that for any finite set of points K in the plane, and for any finite integer s, one can assign a list of s distinct colors to each point of the plane, so that any coloring of the plane that colors each point by a col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000